Irreducible, pattern k-potent ray pattern matrices

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Powers of Ray Pattern Matrices

We examine the similarities and differences between results for powers of sign pattern matrices and for powers of ray pattern matrices. In particular, we investigate what is known about k-potent patterns and powerful patterns in both the irreducible and reducible cases. 1 Signs, Rays, Sign & Ray Patterns Since at least the 1960’s, the qualitative theory of real matrices has been an extremely fr...

متن کامل

Ela on K-potent Matrices

The paper provides extensive and systematic investigations of k-potent complex matrices, with a particular attention paid to tripotent matrices. Several new properties of k-potent matrices are identified. Furthermore, some results known in the literature are reestablished with simpler proofs than in the original sources and often in a generalized form.

متن کامل

Sign Pattern Matrices that Admit P0 Matrices

A P0-matrix is a real square matrix all of whose principle minors are nonnegative. In this paper, we consider the class of P0-matrix. Our main aim is to determine which sign pattern matrices are admissible for this class of real matrices. Keywords—Sign pattern matrices, P0 matrices, graph, digraph

متن کامل

Pattern statistics and Vandermonde matrices

In this paper, we determine some limit distributions of pattern statistics in rational stochastic models. We present a general approach to analyze these statistics in rational models having an arbitrary number of strongly connected components. We explicitly establish the limit distributions in most significant cases; they are characterized by a family of unimodal density functions defined by me...

متن کامل

Pattern-Guided k-Anonymity

We suggest a user-oriented approach to combinatorial data anonymization. A data matrix is called k-anonymous if every row appears at least k times—the goal of the NP-hard k-ANONYMITY problem then is to make a given matrix k-anonymous by suppressing (blanking out) as few entries as possible. Building on previous work and coping with corresponding deficiencies, we describe an enhanced k-anonymiza...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2002

ISSN: 0024-3795

DOI: 10.1016/s0024-3795(01)00541-9